Weighted Simple and Semi-Simple Splicing Systems

Semi-simple splicing systems

In 1987 Tom Head [5] introduced the idea of splicing as a generative mechanism in formal language theory. This mechanism was popularized and extensively developed by Gheorghe Păun and his many coworkers, who recognized much of the subtlety and power of this mechanism and who used it as a foundation for the rapidly developing study of DNA based computing. See, for example, [11] and [12]. (The mo...

Probabilistic simple splicing systems

Articles you may be interested in Some characteristics of probabilistic one-sided splicing systems AIP Conf. Abstract. A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites and attaches the prefix of the fi...

Semi-simple Spli ing Systems

Weighted and roughly weighted simple games

This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern [22]. One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The necessary and sufficient conditions that guarantee weightedness were obtained by Elgot [3] and refined by Tay...

Simple Distributed Weighted Matchings

Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the obvious sequential greedy algorithm [Pre99], that computes a weighted matching at most a factor 2 away from the maximum, is easily distributed. This yiel...